Optimization of A Fed-Batch Fermenter Producing Bakerâs Yeast Using Simulated Annealing Method
نویسندگان
چکیده مقاله:
Modeling of fermentation processes is so complicated and uncertain; therefore it is necessary to provide a robust and appropriate dynamic optimization method. In order to obtain the maximum amount of yeast (Saccharomyces cerevisiae), the bioreactor must be operated under optimal conditions. To determine substrate feeding in a fed-batch bioreactor, a simulated annealing (SA) approach was examined. The optimal glucose feed rate profiles were computed by a stochastic and deterministic problems for various initial conditions to investigate their effects on optimal operation of the fed-batch bioreactor. Results declared a proper capability of SA method for determination of optimal feeding policies in fermentation processes. The major advantage of the simulated annealing is its capability for handling the problems with model mismatches. Finally, an open loop sensitivity analysis of SA optimization method was tested by a mathematical model to note the effect of some key variables in the subsequent optimization study on the fermenter. Findings show slight difference between trends, thus the SA algorithm is an efficient, robust and satisfactory acceptable.
منابع مشابه
optimization of a fed-batch fermenter producing bakerâs yeast using simulated annealing method
modeling of fermentation processes is so complicated and uncertain; therefore it is necessary to provide a robust and appropriate dynamic optimization method. in order to obtain the maximum amount of yeast (saccharomyces cerevisiae), the bioreactor must be operated under optimal conditions. to determine substrate feeding in a fed-batch bioreactor, a simulated annealing (sa) approach was examine...
متن کاملRANI: OPTIMAL CONTROL OF A FED-BATCH FERMENTER USING PARAMETERIZED DATA-DRIVEN MODELS 759 Optimal control of a fed-batch fermenter using parameterized data-driven models#
An optimal control approach is proposed for semi-batch processes based on parameterized data-driven (PDD) model structures. Orthonormally parameterized input trajectories, initial states and process parameters are inputs to the model, which predicts output trajectories in terms of Fourier coefficients. Two model structures (linear and quadratic) are incorporated into PDD modeling approach, and ...
متن کاملA Simulated Annealing-based Immune Optimization Method
This paper proposes a hybrid optimization method based on the fusion of the Simulated Annealing (SA) and Clonal Selection Algorithm (CSA), in which the SA is embedded in the CSA to enhance its search capability. The novel optimization algorithm is also employed to deal with several nonlinear benchmark functions as well as a practical engineering design problem. Simulation results demonstrate th...
متن کاملSimulated Annealing For The Optimization Of Chemical Batch Production Processes1
Batch distillation processes are widely used in chemical industry. In this work, we consider the optimization of such processes by simulated annealing. Although this method is stochastically in nature, it has two evitable advantages: it can be readily connected to highly sophisticated simulation codes and it converges towards a global optimum. According to the characteristics of batch distillat...
متن کاملOptimization of Time, Cost, and Quality in Critical Chain Method Using Simulated Annealing (RESEARCH NOTE)
In the last decade, theory of constraint application in project management lead to make a new approach for project scheduling and control as a critical chain. In this paper, a multi-objective optimization model for multi-project scheduling on critical chain is investigated. The objectives include time, cost and quality. In order to solve the problem, a Simulated Annealing algorithm is developed...
متن کاملSolving Bus Terminal Location Problem Using Simulated Annealing Method
Bus network design is an important problem in public transportation. A main step to this design is determining the number of required terminals and their locations. This is a special type of facility location problem, which is a time-consuming, large scale, combinatorial problem. In a previous attempt by the authors, this problem had been solved by GAMS, based on a branch and bound algorithm.&...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 7 شماره 3
صفحات 157- 165
تاریخ انتشار 2009-07-01
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023